A calibration method for non-positive definite covariance matrix in multivariate data analysis
نویسندگان
چکیده
منابع مشابه
Automatic positive semi-definite HAC covariance matrix and GMM estimation
This paper proposes a new class of HAC covariance matrix estimators. The standard HAC estimation method re-weights estimators of the autocovariances. Here we initially smooth the data observations themselves using kernel function based weights. The resultant HAC covariance matrix estimator is the normalised outer product of the smoothed random vectors and is therefore automatically positive sem...
متن کاملCOVARIANCE MATRIX OF MULTIVARIATE REWARD PROCESSES WITH NONLINEAR REWARD FUNCTIONS
Multivariate reward processes with reward functions of constant rates, defined on a semi-Markov process, first were studied by Masuda and Sumita, 1991. Reward processes with nonlinear reward functions were introduced in Soltani, 1996. In this work we study a multivariate process , , where are reward processes with nonlinear reward functions respectively. The Laplace transform of the covar...
متن کاملAnalyzing a Regression Model with a General Positive Definite Covariance Matrix with The SAS System
This article discusses and proposes a procedure for the analysis of the univariate linear regression model with known general positive definite covariance matrix with SAS/STAT software of the SAS System. Estimation of parameters, hypothesis testing, estimation under constraints and collinearity and influence diagnostics are reviewed. An example is given to illustrate the procedure.
متن کاملPrioritization method for non-extreme ecient unitsin data envelopment analysis
Super eciency data envelopment analysis(DEA) model can be used in ranking the performanceof ecient decision making units(DMUs). In DEA, non-extreme ecient unitshave a super eciency score one and the existing super eciency DEA models do notprovide a complete ranking about these units. In this paper, we will propose a methodfor ranking the performance of the extreme and non-extreme ecient units.
متن کاملActive Positive-Definite Matrix Completion
In the FindCandidates function (line 4), Select finds all the single edges that can be added to the current mask graph GΩ while maintaining its chordal structure. To do that, we make use of the clique tree data structure as introduced by Ibarra [1]. Given a graph G = (V,E), the clique tree is a tree C = (VC , EC), in which each node is a maximal clique of G, i.e., VC ⊂ 2 . In our case the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 2017
ISSN: 0047-259X
DOI: 10.1016/j.jmva.2017.03.001